On the Approximation of the Rectilinear Steiner Arborescence Problem in the Plane
نویسنده
چکیده
We give a polynomial time approximation scheme (PTAS) for the recti-linear Steiner arborescence problem in the plane. The result is obtained by modifying Arora's PTAS for Euclidean TSP. The previously best known result was a 2-approximation algorithm.
منابع مشابه
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
Abst ract Given a set N of n terminals in the rst quadrant of the Euclidean plane E 2 , nd a minimum length directed tree rooted at the origin o, connecting to all terminals in N, and consisting of only horiz on tal and vertical arcs oriented from left to right or from bottom to top. This problem is called rectilinear Steiner arborescence problem. which has been proved to be NP-complete recentl...
متن کاملA Polynomial Time Approximation Scheme for the Symmetric Rectilinear Steiner Arborescence Problem
The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, ...
متن کاملSubexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
A rectilinear Steiner tree for a set T of points in the plane is a tree which connects T using horizontal and vertical lines, In the Rectilinear Steiner Tree problem, input is a set T of n points in the Euclidean plane (R) and the goal is to find an rectilinear Steiner tree for T of smallest possible total length. A rectilinear Steiner arborecence for a set T of points and root r ∈ T is a recti...
متن کاملThe Depth-Restricted Rectilinear Steiner Arborescence Problem is NP-complete
In the rectilinear Steiner arborescence problem the task is to build a shortest rectilinear Steiner tree connecting a given root and a set of terminals which are placed in the plane such that all root-terminal-paths are shortest paths. This problem is known to be NP-hard. In this paper we consider a more restricted version of this problem. In our case we have a depth restrictions d(t) ∈ N for e...
متن کاملPolynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem
The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000